Enumerating Tilings of Rectangles by Squares with Recurrence Relations
نویسنده
چکیده
Counting the number of ways to tile an m × n rectangle with squares of various sizes is a traditional combinatorial problem. In this paper, we demonstrate a simple method for constructing the recurrence relations satisfied by the solutions to these problems. This method also generalizes to similar problems that have not been previously considered, including three dimensional “tilings”. We are able to give an upper bound on the minimal order of the recurrence satisfied for fixed m, as well as to prove that there does not exist a graph whose matchings form a one–to–one correspondence with such tilings.
منابع مشابه
Alternating sign matrices and tilings of Aztec rectangles
The problem of counting numbers of tilings of certain regions has long interested researchers in a variety of disciplines. In recent years, many beautiful results have been obtained related to the enumeration of tilings of particular regions called Aztec diamonds. Problems currently under investigation include counting the tilings of related regions with holes and describing the behavior of ran...
متن کاملEnumeration of Tilings of Quartered Aztec Rectangles
We generalize a theorem of W. Jockusch and J. Propp on quartered Aztec diamonds by enumerating the tilings of quartered Aztec rectangles. We use subgraph replacement method to transform the dual graph of a quartered Aztec rectangle to the dual graph of a quartered lozenge hexagon, and then use Lindström-GesselViennot methodology to find the number of tilings of a quartered lozenge hexagon.
متن کاملCounting Domino Tilings of Rectangles via Resultants
The classical cosine formula for enumerating domino tilings of a rectangle, due to Kasteleyn, Temperley, and Fisher is proved using a combination of standard tools from combinatorics and algebra. For further details see [4].
متن کاملRigid Tilings of Quadrants by L-Shaped n-ominoes and Notched Rectangles
In this paper, we examine rigid tilings of the four quadrants in a Cartesian coordinate system by tiling sets consisting of L-shaped polyominoes and notched rectangles. The first tiling sets we consider consist of an L-shaped polyomino and a notched rectangle, appearing from the dissection of an n×n square, and of their symmetries about the first diagonal. In this case, a tiling of a quadrant i...
متن کاملTiling with L’s and Squares
We consider tilings of 2 × n, 3 × n, and 4 × n boards with 1 × 1 squares and Lshaped tiles covering an area of three square units, which can be used in four different orientations. For the 2 × n board, the recurrence relation for the number of tilings is of order three and, unlike most third order recurrence relations, can be solved exactly. For the 3 × n and 4 × n board, we develop an algorith...
متن کامل